scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms

نویسندگان

javad rezaeian

hany seidgar

morteza kiani

چکیده

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga and ica are proposed to solve the generated problems. the performances of algorithms are evaluated by computational time and relative percentage deviation (rpd) factors. the results indicate that ica solves the problems faster than other algorithms and the hybrid algorithm produced best solution based on rpd.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...

متن کامل

Scheduling of a Hybrid Flow Shop with Multiprocessor Tasks by a Hybrid Approach Based on Genetic and Imperialist Competitive Algorithms

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

متن کامل

Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

متن کامل

Flow shop Scheduling Problem with Maintenance Coordination: a New Approach

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of optimization in industrial engineering

ناشر: qiau

ISSN 2251-9904

دوره 6

شماره 13 2013

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023